Void Traversal for Guaranteed Delivery in Geometric Routing

Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a planar graph, they require a unit-disk graph. To make the topology unit-disk, the maximum link length in the network has to be selected conservatively. In practical setting this leads to the designs where the node density is rather high. Moreover, the network diameter of a planar subgraph is greater than the original graph, which leads to longer routes. To remedy this problem, we propose a void traversal algorithm that works on arbitrary geometric graphs. We describe how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG

Corona: a stabilizing deterministic message-passing skip list

We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in a message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identifiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of arbitrary non-existent fictitious nodes created by the attacker. Similar to failure detectors, we propose to use universe detectors to help nodes determine which universe is real. In this paper, we (i) define several variants of the neighborhood discovery problem under Sybil attack (ii) propose a set of matching universe detectors (iii) demonstrate the necessity of additional topological constraints for the problems to be solvable: node density and communication range; (iv) present SAND -- an algorithm that solves these problems with the help of appropriate universe detectors, this solution demonstrates that the proposed universe detectors are the weakest detectors possible for each problem

Electromagnetic Waves Excitation by Thin Impedance Vibrators and Narrow Slots in Electrodynamic Volumes

Linear vibrator and slot radiators, i.e., radiators of electric and magnetic type, respectively, are widely used as separate receiver and transmitter structures, elements of antenna systems, and antenna-feeder devices, including combined vibrator-slot structures. Widespread occurrence of such radiators is an objective prerequisite for theoretical analysis of their electrodynamic characteristics. During the last decades, researchers have published results which make it possible to create a modern theory of thin vibrator and narrow slot radiators. This theory combines the fundamental asymptotic methods for determining the single radiator characteristics, the hybrid analytic-numerical approaches, and the direct numerical techniques for electrodynamic analysis of such radiators. However, the electrodynamics of single linear electric and magnetic radiators is far from been completed. It may be explained by further development of modern antenna techniques and antenna-feeder devices, which can be characterized by such features as multielement structures, integration, and modification of structural units to minimize their mass and dimensions and to ensure electromagnetic compatibility of radio aids, application of metamaterials, formation of required spatial-energy, and spatial-polarization distributions of electromagnetic fields in various nondissipative and dissipative media. To solve these tasks, electric and magnetic radiators, based on various impedance structures with irregular geometric or electrophysical parameters and on combined vibrator-slot structures, should be created. This chapter presents the methodological basis for application of the generalized method of induced EMMF for the analysis of electrodynamic characteristics of the combined vibrator-slot structures. Characteristic feature of the generalization to a new class of approximating functions consists in using them as a function of the current distributions along the impedance vibrator and slot elements; these distributions are derived as the asymptotic solution of integral equations for the current (key problems) by the method of averaging. It should be noted that for simple structures similar to that considered in the model problem, the proposed approach yields an analytic solution of the electrodynamic problem. For more complex structures, the method may be used to design effective numerical-analytical algorithms for their analyses. The demonstrative simulation (the comparative analysis of all electrodynamic characteristics in the operating frequencies range) has confirmed the validity of the proposed generalized method of induced EMMF for analysis of vibrator-slot systems with rather arbitrary structure (within accepted assumptions). Here, as examples, some fragments of this comparative analysis were presented. This method retains all benefits of analytical methods as compared with direct numerical methods and allows to expand significantly the boundaries of numerical and analytical studies of practically important problems, concerning the application of single impedance vibrator, including irregular vibrator, the systems of such vibrators, and narrow slots

Rare decay pi0 -> e+e-: theory confronts KTeV data

Within the dispersive approach to the amplitude of the rare decay pi0 -> e+e- the nontrivial dynamics is contained only in the subtraction constant. We express this constant, in the leading order in (m_e/\Lambda)^2 perturbative series, in terms of the inverse moment of the pion transition form factor given in symmetric kinematics. By using the CELLO and CLEO data on the pion transition form factor given in asymmetric kinematics the lower bound on the decay branching ratio is found. The restrictions following from QCD allow us to make a quantitative prediction for the branching B(pi0 -> e+e-) =(6.2\pm 0.1)*10^{-8} which is 3\sigma below the recent KTeV measurement. We confirm our prediction by using the quark models and phenomenological approaches based on the vector meson dominance. The decays \eta -> l^+l^- are also discussed.Comment: 7 pages, 1 figur

Multiple (inverse) binomial sums of arbitrary weight and depth and the all-order epsilon-expansion of generalized hypergeometric functions with one half-integer value of parameter

We continue the study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we show the following results: Theorem A: The multiple (inverse) binomial sums of arbitrary weight and depth (see Eq. (1.1)) are expressible in terms of Remiddi-Vermaseren functions. Theorem B: The epsilon expansion of a hypergeometric function with one half-integer value of parameter (see Eq. (1.2)) is expressible in terms of the harmonic polylogarithms of Remiddi and Vermaseren with coefficients that are ratios of polynomials. Some extra materials are available via the www at this http://theor.jinr.ru/~kalmykov/hypergeom/hyper.htmlComment: 24 pages, latex with amsmath and JHEP3.cls; v2: some typos corrected and a few references added; v3: few references added

Self-Stabilizing Routing in Wireless Embedded

We address the problem of routing tree maintenance in a network of embedded sensors. We compare two routing protocols. One protocol periodically discards and reconstructs the routing tree. The other uses incremental routing tree construction. We analyze their advantages and disadvantages and describe experiments to which we subjected the protocols to compare their performance. We propose a protocol that combines the best features of both original protocols